Binary Diagrams for Storing Ascending Compositions
نویسندگان
چکیده
منابع مشابه
Binary Diagrams for Storing Ascending Compositions
It is known that the integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. In this paper we give an efficient data structure for storing all ascending compositions of a positive integer. Using this structure, we improved the fastest known algorithm for generating integer partitions.
متن کاملFast Algorithm for Generating Ascending Compositions
In this paper we give a fast algorithm to generate all partitions of a positive integer n. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known the fact that the ascending composition generation algorithm is substantially more efficient than its descending composition counterpart. Using tree structures for storin...
متن کاملEquational Binary Decision Diagrams Equational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملCompressing Binary Decision Diagrams
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparis...
متن کاملEquational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2012
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxs111